A Heterogeneous Network Game Perspective of Fashion Cycle
نویسندگان
چکیده
Fashion, as a “second nature” of human being, has great economic impacts. In this paper, we apply a heterogenous network game to analyze the existence of a fashion cycle. There are two types of agents in the network game, conformists and rebels. Conformists prefer to match the action taken by the majority of her neighbors while rebels like to mismatch. Our results imply that social interaction structures play a crucial role in the evolution of fashion, especially the emergence of fashion cycles. For example, with a social network composed of a line or a ring, fashion will almost always evolve into a steady state where no flux is possible and thus can be deemed as disappeared. When the network is a star, however, for approximately half of all the configurations of agents’ types, a fashion cycle of length 4 will always emerge, regardless of the initial action profiles. ∗This is a sister working paper with: Bo-yu Zhang, Zhi-gang Cao, Cheng-zhong Qin, Xiao-guang Yang, Fashion and Homophily (April 14, 2013). Available at SSRN: http://ssrn.com/abstract=2250898 or http://dx.doi.org/10.2139/ssrn.2250898. The research of the first and third authors are supported by the 973 Program (2010CB731405) and National Natural Science Foundation of China (71101140). We gratefully acknowledge helpful discussions with Xujin Chen, Zhiwei Cui, Xiaodong Hu, Weidong Ma, Changjun Wang, Lin Zhao, and Wei Zhu. †Key Laboratory of Management, Decision & Information Systems, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China. Email: [email protected]. ‡Department of Economics, University of California, Santa Barbara, CA 93106, USA. Email: [email protected]. §Key Laboratory of Management, Decision & Information Systems, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China. Email: [email protected]. ¶Department of Mathematics, Beijing Normal University, Beijing, 100875, China. Email: [email protected].
منابع مشابه
A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملFashion and Homophily∗
Fashion, as a “second nature” to human being, plays a quite non-trivial role not only in economy but also in many other areas of our society, including education, politics, arts, and even academics. We investigate fashion through a network game model, which is referred to as the fashion game, where there are two types of agents, conformists and rebels, who are allocated on a network. Each agent...
متن کاملIntegrated Competitive Pricing and Transshipment Problem for Short Life Cycle Products’ Supply Chain
This paper integrates competitive pricing and network design problems for the short life cycle products. The pricing problem determines selling prices of the products for different life cycle phases in a competitive market, as well as acquisition management of returned products. Besides, the selling and acquisition prices are related to the distance between distribution centers and customers. T...
متن کاملChanges in a Service Oriented Enterprise: A Game Theory Approach
Service Oriented Enterprises (SOEs) are subject to constant change and variation. In this paper, the changes are considered from an economic perspective based on service culture notion. Once a change is implemented, the costs of some member services may increase, whereas the costs of some other services may reduce. We construct a game theoretic model trying to capture the possible conflicting i...
متن کاملA Game Theoretic Approach to Distributed Coverage of Graphs by Heterogeneous Mobile Agents
In this paper, we study the problem of covering an apriori unknown network structure by a group of mobile agents with possibly nonidentical coverage and communication capabilities. The network is represented as a graph, and the agents are mobile devices that explore and cover the graph in a decentralized fashion. We study this problem in a game theoretic setting and achieve optimal coverage thr...
متن کامل